Finding a Path is Harder than Finding a Tree
نویسندگان
چکیده
منابع مشابه
Finding a path is harder than finding a tree
I consider the problem of learning an optimal path graphical model from data and show the problem to be NP-hard for the maximum likelihood and minimum description length approaches and a Bayesian approach. This hardness result holds despite the fact that the problem is a restriction of the polynomially solvable problem of nding the optimal tree graphical model.
متن کاملFinding a maximum-weight vertex-weighted triangle is not harder than matrix multiplication
We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in timeO(nω+n2+o(1)), where ω is the exponent of fastest matrix multiplication algorithm. By the currently best bound on ω, the running time of our algorithm isO(n2.376). Our algorithm substantially improves the previous time-bounds for this problem recently establish...
متن کاملFinding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication
We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(nω + n2+o(1)), where ω is the exponent of the fastest matrix multiplication algorithm. By the currently best bound on ω, the running time of our algorithm is O(n2.376). Our algorithm substantially improves the previous time-bounds for this problem, and its a...
متن کاملFinding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E , where w(e) is an edge weight function for e ∈ E . The density of a path, say e1, e2, . . . , ek , is defined as ∑k i=1 w(ei )/k. The length of a path is the number of its edges. Given a tree with n edges and a lower bound L where 1 ≤ L ≤ n, this paper presents two efficient algorithms for finding a maximum-den...
متن کاملMinimum-Cost Spanning Tree as a Path-Finding Problem
In this paper we show that minimum-cost spanning tree is a special case of the closed semiring path-nding problem. This observation gives us a non-recursive algorithm for nding minimum-cost spanning trees on mesh-connected computers that has the same asymptotic running time but is much simpler than the previous recursive algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2001
ISSN: 1076-9757
DOI: 10.1613/jair.914